Multicommodity Network Flow Problems
نویسندگان
چکیده
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities. This property often turns to be very useful in practical applications. We show some results of numerical experiments and examine the effectiveness of the proposed algorithm.
منابع مشابه
Optimal multicommodity flows in dynamic networks and algorithms for their finding
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand function ...
متن کاملTwelve: Maximal Flow, Shortest Path, Multicommodity Flow, and Network Synthesis Problems
Two special and important network flow problems are the maximal flow problem and the shortest path problem. Both of these problems can be solved by either the network simplex method of Chapter 9 or the out-of-kilter algorithm of Chapter 11. However, their frequent occurrence in practice and the specialized, more efficient procedures that can be developed for handling these two problems provide ...
متن کاملAdvances in Solving the Multicommodity-Flow Problem
The multicommodity-flow problem arises in a wide variety of important applications. Many communications, logistics, manufacturing , and transportation problems can be formulated as large multicommodity-flow problems. During the last few years researchers have made steady advances in solving extremely large multicommodity-flow problems. This improvement has been due both to algorithmic and to ha...
متن کاملDewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems
We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملM ay 2 01 2 Faster Approximate Multicommodity Flow Using Quadratically Coupled Flows ∗
The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a 1 − ǫ approximation to the multicommodity flow problem on graphs is a well-studied problem. In this paper we present an adaptation of recent advances in single-commodity flow algorithms to this problem. As the underlying linear systems in the electrical p...
متن کامل